The domatic number problem: Boolean hierarchy completeness and exact exponential time algorithms
نویسنده
چکیده
iii Acknowledgments I want to thank my thesis advisor Jörg Rothe for all of his support during the past four years. In the first place, I am deeply grateful to him for giving me the chance to be part of his research team. Without his great efforts, I would never have had the chance to work in the scientific community. Many inspiring and valuable discussions with him initiated fruitful ideas that led to the research presented in this thesis. I am very thankful to him for letting me have a share of his mathematical precision. In addition, his profound knowledge of the English language helped a great deal to spice up our articles. Next I would like to thank all my coauthors, including Jörg Rothe, and Johannes jr.: Thanks for being there! Last but not least, I would like to thank Egon Wanke for serving as a reviewer for this thesis.
منابع مشابه
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems
This paper surveys some of the work that was inspired by Wagner’s general technique to prove completeness in the levels of the boolean hierarchy over NP and some related results. In particular, we show that it is DP-complete to decide whether or not a given graph can be colored with exactly four colors, where DP is the second level of the boolean hierarchy. This result solves a question raised ...
متن کاملCompleteness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey
This paper surveys some of the work that was inspired by Wagner’s general technique to prove completeness in the levels of the boolean hierarchy over NP and some related results. In particular, we show that it is DP-complete to decide whether or not a given graph can be colored with exactly four colors, where DP is the second level of the boolean hierarchy. This result solves a question raised ...
متن کاملImproving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem
NP-complete problems cannot have efficient algorithms unless P = NP. Due to their importance in practice, however, it is useful to improve the known exponential-time algorithms for NP-complete problems. We survey some of the recent results on such improved exponential-time algorithms for the NP-complete problems satisfiability, graph colorability, and the domatic number problem. The determinist...
متن کاملPolynomial Space Algorithms for Counting Dominating Sets and the Domatic Number
Inclusion/exclusion and measure and conquer are two of the most important recent new developments in the field of exact exponential time algorithms. Algorithms that combine both techniques have been found very recently, but thus far always use exponential space. In this paper, we try to obtain fast exponential time algorithms for graph domination problems using only polynomial space. Using a no...
متن کاملAn Exact 2.9416n Algorithm for the Three Domatic Number Problem
The three domatic number problem asks whether a given undirected graph can be partitioned into at least three dominating sets, i.e., sets whose closed neighborhood equals the vertex set of the graph. Since this problem is NP-complete, no polynomial-time algorithm is known for it. The naive deterministic algorithm for this problem runs in time 3n, up to polynomial factors. In this paper, we desi...
متن کامل